A Simple Algorithm for Coloring m-Clique Holes
نویسنده
چکیده
An m-clique hole is a sequence φ = (Φ1,Φ2, . . . ,Φm) of m distinct cliques such that |Φi| ≤ m for all i = 1, 2, . . . ,m, and whose clique graph is a hole on m vertices. That is, φ is an m-clique hole if for all i 6= j, i, j = 1, 2, . . . ,m, Φi∩Φj 6= ∅ if and only if (j − 1) mod m = (j + 1) mod m = i mod m. This paper derives a sufficient and necessary condition on m-colorability of m-clique holes, and proposes a coloring algorithm that colors mclique holes with exactly m colors.
منابع مشابه
Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
In this paper we consider the class of simple graphs defined by excluding, as induced subgraphs, even holes (i.e., chordless cycles of even length) and diamonds (i.e., a graph obtained from a clique of size 4 by removing an edge). We say that such graphs are (evenhole, diamond)-free. For this class of graphs we first obtain a decomposition theorem, using clique cutsets, bisimplicial cutsets (wh...
متن کاملSimple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique
We consider a branch-and-bound algorithm for maximum clique problems. We introduce cost based filtering techniques for the so-called candidate set (i.e. a set of nodes that can possibly extend the clique in the current choice point). Additionally, we present a taxonomy of upper bounds for maximum clique. Analytical results show that our cost based filtering is in a sense as tight as most of the...
متن کاملMAXIMUM CLIQUE and MINIMUM CLIQUE PARTITION in Visibility Graphs
In an alternative approach to “characterizing” the graph class of visibility graphs of simple polygons, we study the problem of finding a maximum clique in the visibility graph of a simple polygon with n vertices. We show that this problem is very hard, if the input polygons are allowed to contain holes: a gap-preserving reduction from the maximum clique problem on general graphs implies that n...
متن کاملMaximum Clique and Minimum
In an alternative approach to \characterizing" the graph class of visibility graphs of simple polygons, we study the problem of nding a maximum clique in the visibility graph of a simple polygon with n vertices. We show that this problem is very hard, if the input polygons are allowed to contain holes: a gap-preserving reduction from the maximum clique problem on general graphs implies that no ...
متن کاملA Tight Analysis of Kierstead-Trotter Algorithm for Online Unit Interval Coloring
Kierstead and Trotter (Congressus Numerantium 33, 1981) proved that their algorithm is an optimal online algorithm for the online interval coloring problem. In this paper, for online unit interval coloring, we show that the number of colors used by the Kierstead-Trotter algorithm is at most 3ω(G)− 3, where ω(G) is the size of the maximum clique in a given graph G, and it is the best possible.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1508.06967 شماره
صفحات -
تاریخ انتشار 2015